Output-sensitive algorithms for computing nearest-neighbour decision boundariesBREMNER, David; DEMAINE, Erik; ERICKSON, Jeff et al.Lecture notes in computer science. 2003, pp 451-461, issn 0302-9743, isbn 3-540-40545-3, 11 p.Conference Paper

Dynamic optimality-almostDEMAINE, Erik D; HARMON, Dion; IACONO, John et al.Annual Symposium on Foundations of Computer Science. 2004, pp 484-490, isbn 0-7695-2228-9, 1Vol, 7 p.Conference Paper

QueapsIACONO, John; LANGERMAN, Stefan.Algorithmica. 2005, Vol 42, Num 1, pp 49-56, issn 0178-4617, 8 p.Conference Paper

Key independent optimalityIACONO, John.Lecture notes in computer science. 2002, pp 25-31, issn 0302-9743, isbn 3-540-00142-5, 7 p.Conference Paper

QueapsIACONO, John; LANGERMAN, Stefan.Lecture notes in computer science. 2002, pp 211-218, issn 0302-9743, isbn 3-540-00142-5, 8 p.Conference Paper

On the hierarchy of distribution-sensitive properties for data structuresELMASRY, Amr; FARZAN, Arash; IACONO, John et al.Acta informatica. 2013, Vol 50, Num 4, pp 289-295, issn 0001-5903, 7 p.Article

Key-independent optimalityIACONO, John.Algorithmica. 2005, Vol 42, Num 1, pp 3-10, issn 0178-4617, 8 p.Conference Paper

Necklaces, Convolutions, and X + YBREMNER, David; CHAN, Timothy M; DEMAINE, Erik D et al.Algorithmica. 2014, Vol 69, Num 2, pp 294-314, issn 0178-4617, 21 p.Article

A unified access bound on comparison-based dynamic dictionariesBADOIU, Mihai; COLE, Richard; DEMAINE, Erik D et al.Theoretical computer science. 2007, Vol 382, Num 2, pp 86-96, issn 0304-3975, 11 p.Conference Paper

Necklaces, convolutions, and X + YBREMNER, David; CHAN, Timothy M; DEMAINE, Erik D et al.Lecture notes in computer science. 2006, pp 160-171, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Data structures for halfplane proximity queries and incremental voronoi diagramsARONOV, Boris; BOSE, Prosenjit; DEMAINE, Erik D et al.Lecture notes in computer science. 2006, pp 80-92, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 13 p.Conference Paper

The complexity of diffuse reflections in a simple polygonARONOV, Boris; DAVIS, Alan R; IACONO, John et al.Lecture notes in computer science. 2006, pp 93-104, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

The Cost of Cache-Oblivious SearchingBENDER, Michael A; BRODAL, Gerth Støling; FAGERBERG, Rolf et al.Algorithmica. 2011, Vol 61, Num 2, pp 463-505, issn 0178-4617, 43 p.Article

DYNAMIC OPTIMALITY-ALMOSTDEMAINE, Erik D; HARMON, Dion; IACONO, John et al.SIAM journal on computing (Print). 2008, Vol 37, Num 1, pp 240-251, issn 0097-5397, 12 p.Article

Grid vertex-unfolding orthostacksDEMAINE, Erik D; IACONO, John; LANGERMAN, Stefan et al.Lecture notes in computer science. 2005, pp 76-82, issn 0302-9743, isbn 3-540-30467-3, 1Vol, 7 p.Conference Paper

A locality-preserving cache-oblivious dynamic dictionaryBENDER, Michael A; ZIYANG DUAN; IACONO, John et al.Journal of algorithms (Print). 2004, Vol 53, Num 2, pp 115-136, issn 0196-6774, 22 p.Article

Space-efficient planar convex hull algorithmsBRÖNNIMANN, Hervé; IACONO, John; KATAJAINEN, Jyrki et al.Theoretical computer science. 2004, Vol 321, Num 1, pp 25-40, issn 0304-3975, 16 p.Conference Paper

In-place planar convex hull algorithmsBRÖNNIMANN, Hervé; IACONO, John; KATAJAINEN, Jyrki et al.Lecture notes in computer science. 2002, pp 494-507, issn 0302-9743, isbn 3-540-43400-3Conference Paper